منابع مشابه
A Whitehead Algorithm for Toral Relatively hyperbolic Groups
The Whitehead problem is solved in the class of toral relatively hyperbolic groups G (i.e. torsion-free relatively hyperbolic groups with abelian parabolic subgroups): there is an algorithm which, given two finite tuples (u1, . . . , un) and (v1, . . . , vn) of elements of G, decides whether there is an automorphism of G taking ui to vi for all i.
متن کاملTest Groups for Whitehead Groups
We consider the question of when the dual of a Whitehead group is a test group for Whitehead groups. This turns out to be equivalent to the question of when the tensor product of two Whitehead groups is Whitehead. We investigate what happens in different models of set theory.
متن کاملWhitehead Groups of Finite Groups
In 1966, Milnor surveyed in this Bulletin [23] the concept of Whitehead torsion, focusing on the definition, topological significance and computation of Whitehead groups and their relationship to algebraic ^-theory and the congruence subgroup problem. As Milnor showed in that survey [23, Appendix 1], an affirmative solution to the congruence subgroup problem for algebraic number fields would im...
متن کاملBorel Whitehead Groups
We investigate the Whiteheadness of Borel abelian groups (א1-free, without loss of generality as otherwise this is trivial). We show that CH (and even WCH) implies any such abelian group is free, and always א2-free. 1998 Mathematics Subject Classification 03C60, 03E15, 20K20.
متن کاملA hybrid search algorithm for the Whitehead Minimization problem
The Whitehead Minimization problem is a problem of finding elements of the minimal length in the automorphic orbit of a given element of a free group. The classical algorithm of Whitehead that solves the problem depends exponentially on the group rank. Moreover, it can be easily shown that exponential blowout occurs when a word of minimal length has been reached and, therefore, is inevitable ex...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Topology
سال: 2000
ISSN: 0040-9383
DOI: 10.1016/s0040-9383(99)00027-0